Discovering Planning Invariants as Anomalies in State Descriptions
نویسندگان
چکیده
Planning invariants are formulae that are true in every reachable state of a planning world. We describe a novel approach to the problem of discovering such invariants—by analyzing only a reachable state of the planning domain, and not its operators. Our system works by exploiting perceived patterns and anomalies in the state description: It hypothesizes that patterns that are very unlikely to have arisen by chance represent features of the planning world. We demonstrate that the number and types of laws we discover are comparable to those discovered by a system that uses complete operator descriptions in addition to a state description.
منابع مشابه
State-based Discovery and Verification of Propositional Planning Invariants
Planning invariants are formulae that are true in every reachable state of a planning world. We describe a novel approach to the problem of discovering such invariants in propositional form—by analyzing only a set of reachable states of the planning domain, and not its operators. Our system works by exploiting perceived patterns of propositional covariance across the set of states: It hypothesi...
متن کاملDiscovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of discovering state invariants in planning domains. State invariants are formulas that if true in a state, will be true in all successor states. In this paper, we consider the following four types of state invariants commonly...
متن کاملDISCOPLAN: an Efficient On-line System for Computing Planning Domain Invariants
DISCOPLAN is an efficient system for discovering state invariants in planning domains with conditional effects. Among the types of invariants found are implicative constraints relating a fluent predication to a fluent or static predication (with allowance for static supplementary conditions), single-valuedness constraints, exclusiveness constraints, and several others. The algorithms used are p...
متن کاملDiscovering Invariants in the Analysis and Verification of Finite State Transition Systems by Jie-Hong
Discovering Invariants in the Analysis and Verification of Finite State Transition Systems
متن کاملThe Automatic Inference of State Invariants in TIM
As planning is applied to larger and richer domains the e ort involved in constructing domain descriptions increases and becomes a signi cant burden on the human application designer. If general planners are to be applied successfully to large and complex domains it is necessary to provide the domain designer with some assistance in building correctly encoded domains. One way of doing this is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005